Tree-adjoining Grammars for Optimality Theory Syntax

نویسندگان

  • Virginia Savova
  • Robert Frank
چکیده

This paper explores an optimality-theoretic approach to syntax based on Tree-Adjoining Grammars (TAG), where two separate optimizations are responsible for the construction of local pieces of tree structure (elementary trees) and the combination of these pieces of structure. The local optimization takes a non-recursive predicate-argument structure (PA-chunk) as an underlying representation and chooses the best tree structure realizing it. The linking optimization takes as an underlying representation a tree whose nodes are labeled by PA-chunks and chooses among a set of structurally isomorphic TAG derivation trees. We provide formal definitions of the OTAG system and prove equivalence in strong generative capacity between OTAG and TAG. Finally, we apply the mechanics of the formal system to the analysis of cross-serial dependencies in Swiss-German.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Short Introduction to Formal Linguistics

1 Mildly Context-Sensitive Syntax 5 1.1 Tree Adjoining Grammars . . . . . . . . . . . . . . . . . . . . . . . 6 1.1.1 Linguistic Analyses Using TAGs . . . . . . . . . . . . . . . . 8 Lexicalized Grammar . . . . . . . . . . . . . . . . . . . . . . 8 Long-Distance Dependencies . . . . . . . . . . . . . . . . . 9 1.1.2 Background: Context-Free Tree Grammars . . . . . . . . . . 10 IO and OI Derivat...

متن کامل

TuLiPA: A syntax-semantics parsing environment for mildly context-sensitive formalisms

In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semant...

متن کامل

Synchronous Tree Adjoining Machine Translation

Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves translation quality without becoming computationally intractable. Using adjoining to model optionality allows general translation patterns to be learned without the clutter of endless variations of optional material. The a...

متن کامل

PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...

متن کامل

Mildly Non-Projective Dependency Grammar

Syntactic representations based on word-to-word dependencies have a long tradition in descriptive linguistics, and receive considerable interest in many computational applications. However, dependency syntax has remained somewhat of an island from a formal point of view, which hampers the exchange of resources and computational methods with other syntactic traditions. In this article, we presen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004